#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int n;
int q[N];
void quick_sort(int l, int r, int q[])
{
	if (l >= r)return;
	int i = l - 1, j = r + 1;
	int x = q[l + r >> 1];
	while (i < j) {
		do i++;
		while (q[i] < x);
		do j--;
		while (q[j] > x);
		if (i < j)swap(q[i], q[j]);
	}
	quick_sort(l, j, q);
	quick_sort(j + 1, r, q);
	
}
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> q[i];
	quick_sort(1, n, q);
	for (int i = 1; i <= n; i++) {
		cout << q[i] << " ";
	}
	return 0;
}